Some New Approaches to Solving Constrained Transfer Line Matching Problems
نویسندگان
چکیده
A common type of matching problem involves finding the strengths for four (4) quadrupoles in a transfer line, that will transport a particular beam at the entrance, to produce a beam at the exit of the line with a specified set of horizontal and vertical Twiss parameters. A number of optics programs may be used to find a solution to this type of problem, but the quadrupole strengths obtained are not always satisfactory or optimal with regard to other requirements. The non-uniqueness of the solutions (different solutions have different phase advances) offers the possibility that some of these other requirements could be used to differentiate between solutions. The constrained, nonlinear, optimization program NPSOL has been integrated into a software package that can use the outputs of various optics codes to formulate nonlinear constraints and objective (merit) functions. The package has been used to look for different solutions for the SLAC transfer lines between linac sectors 1 and 2 for three configurations involving (a) the electron damping ring, (b) the damping ring by-pass, and (c) the positron damping ring. The software is briefly described and a summary of selected results obtained to date is presented.
منابع مشابه
A New Hybrid Flower Pollination Algorithm for Solving Constrained Global Optimization Problems
Global optimization methods play an important role to solve many real-world problems. Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, a new hybrid optimization method called hybrid flower pollination algorithm (FPPSO) is proposed. The method combines the standard flower pollination algorithm (FP) with the par...
متن کاملMultiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems
Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...
متن کاملSequencing Mixed Model Assembly Line Problem to Minimize Line Stoppages Cost by a Modified Simulated Annealing Algorithm Based on Cloud Theory
This research presents a new application of the cloud theory-based simulated annealing algorithm to solve mixed model assembly line sequencing problems where line stoppage cost is expected to be optimized. This objective is highly significant in mixed model assembly line sequencing problems based on just-in-time production system. Moreover, this type of problem is NP-hard and solving this probl...
متن کاملAn Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation
In this paper, a new genetic algorithm (GA) is presented for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. A random key and the related mode list (ML) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (MSSG...
متن کاملA New Approach for Solving Heat and Mass Transfer Equations of Viscoelastic Nanofluids using Artificial Optimization Method
The behavior of many types of fluids can be simulated using differential equations. There are many approaches to solve differential equations, including analytical and numerical methods. However, solving an ill-posed high-order differential equation is still a major challenge. Generally, the governing differential equations of a viscoelastic nanofluid are ill-posed; hence, their solution is a c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000